FINITE GROUPS WHOSE AUTOMORPHISM GROUP HAS ORDER CUBEFREE

ＦＩＮＩＴＥＧＲＯＵＰＳＷＨＯＳＥＡＵＴＯＭＯＲＰＨＩＳＭＧＲＯＵＰＨＡＳＯＲＤＥＲＣＵＢＥＦＲＥＥＬＩＳＨＩＲＯＮＧＡｂｓｔｒａｃｔＬｅｔＧｄｅｎｏｔｅａｆｉｎｉｔｅｇｒｏｕｐ．Ｉｔｉｓｓｈｏｗｎｔｈａｔｉｆ｜Ａｕｔ（Ｇ）｜ｉｓｃｕｂｅｆｒｅ...     

Radiation bursts from particles in the field of compact, impenetrable, astrophysical objects

The radiation emitted by charged, scalar particles in a Schwarzschild field with maximal acceleration corrections is calculated classically and in the tree approximation of quantum field theory. In both instances the particles emit radiation that has characteristics similar to those of gamma-ray bursters.     

一类非线性Schr(o)dinger方程的守恒差分法与Fourier谱方法

考察了一类带导数项的非线性Schrodinger方程的周期边值问题，提出了一种守恒的差分格式，在空间方向上采用Fourier谱方法，证明了格式的稳定性和收敛性．数值试验得到了与理论分析一致的结果．     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.     

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast.